MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
نویسندگان
چکیده
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown to significantly tighten the Lagrangian relaxation relative to the standard local polytope relaxation, while enabling efficient integer programming for solving the subproblems. Additionally, we introduce modified update rules for maximizing the dual function that avoid oscillations and converge faster to an optimum of the relaxed problem, and never get stuck in non-optimal fixed points.
منابع مشابه
Continuous Relaxation of MAP Inference: A Nonconvex Perspective
In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this relaxation is tight, and a discrete stationary point of it can be easily reached by a simple block coordinate descent algorithm. In addition, we study the resolution of this relaxation using popular gradient methods, and further propose a more...
متن کاملMRF Energy Minimization & Beyond via Dual Decomposition
This paper introduces a new rigorous theoretical framework to address discrete MRF-based optimization in computer vision. Such a framework exploits the powerful technique of Dual Decomposition. It is based on a projected subgradient scheme that attempts to solve an MRF optimization problem by first decomposing it into a set of appropriately chosen subproblems and then combining their solutions ...
متن کاملA new criterion for choosing planar subproblems in MAP-MRF inference
We propose an efficient algorithm for finding the maximum a posteriori (MAP) configuration in Markov random fields (MRFs) under the framework of dual decomposition. In the framework, tractable subproblems like binary planar subproblems (BPSPs) have been introduced to obtain more accurate solutions than that of tree-structured subproblems. However, since there are exponentially many BPSPs the be...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملPlanar Decompositions and Cycle Constraints
Dual-decomposition methods for optimization have emerged as an extremely powerful tool for solving combinatorial problems in graphical models. These techniques can be thought of as decomposing a complex model into a collection of easier-to-solve components, providing a variational bound which can then be optimized over its parameters. A wide variety of algorithms have been proposed, often disti...
متن کامل